Remembering Florian Daniel

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remembering remembering.

We developed a laboratory analogue of the "forgot-it-all-along" effect that J. W. Schooler, M. Bendiksen, and Z. Ambadar (1997) proposed for cases of "recovered memories" in which individuals had forgotten episodes of talking about the abuse when they were supposedly amnestic for it. In Experiment 1, participants studied homographs with disambiguating context words; in Test 1 they received stud...

متن کامل

, Donna Rose Addis and Daniel L . Schacter Memory for Emotional Simulations : Remembering a Rosy Future

Mental simulations of future experiences are often concerned with emotionally arousing events. Although it is widely believed that mental simulations enhance future behavior, virtually nothing is known about how memory for these simulations changes over time or whether simulations of emotional experiences are especially well remembered. We used a novel paradigm that combined recently developed ...

متن کامل

Florian et al_ICMCSSE 2012_3

We here propose improved version of elastic graph matching (EGM) as a face detector, called the multi-scale EGM (MS-EGM). In this improvement, Gabor wavelet-based pyramid reduces computational complexity for the feature representation often used in the conventional EGM, but preserving a critical amount of information about an image. The MS-EGM gives us higher detection performance than Viola-Jo...

متن کامل

Probabilistic Graphical Models - Studienarbeit - Florian

solemnly declare that I have written this master thesis independently, and that I have not made use of any aid other than those acknowledged in this master thesis. Neither this master thesis, nor any other similar work, has been previously submitted to any examination board.

متن کامل

Florian Luca Instituto de Matemáticas

Let σk(n) be the sum of the kth powers of the divisors of n. Here, we prove that if (Fn)n≥1 is the Fibonacci sequence, then the only solutions of the equation σk(Fm) = Fn in positive integers k ≥ 2, m and n have k = 2 and m ∈ {1, 2, 3}. The proof uses linear forms in two and three logarithms, lattice basis reduction, and some elementary considerations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Internet Computing

سال: 2020

ISSN: 1089-7801,1941-0131

DOI: 10.1109/mic.2020.2996283